Associating parallel automata network dynamics and strictly one-way cellular automata

Fast one-way cellular automata

Space-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion known to be strict in their time hierarchy from real-time to exponential-time is between real-time and linear-time! We show the surprising result that there exists an infinite hierarchy of properly included OCA-language families in that range. A generalization of a method in [9] is shown which provides ...

Complexity of One-Way Cellular Automata

The Size of One-Way Cellular Automata

We investigate the descriptional complexity of basic operations on real-time one-way cellular automata with an unbounded as well well as a fixed number of cells. The size of the automata is measured by their number of states. Most of the bounds shown are tight in the order of magnitude, that is, the sizes resulting from the effective constructions given are optimal with respect to worst case co...

Topological dynamics of one-dimensional cellular automata

1 Glossary Almost equicontinuous CA has an equicontinuous configuration. Attractor: omega-limit of a clopen invariant set. Blocking word interrupts information flow. Closing CA: distinct asymptotic configurations have distinct images. Column subshift: columns in space-time diagrams. Cross section: one-sided inverse map. ∗Université de Nice Sophia Antipolis, Département d’Informatique, Parc Valr...

The Reduction of Two-Way Automata to One-Way Automata

We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction rather than on crossing sequence analysis.